Virtually geometric words and Whitehead’s algorithm
نویسندگان
چکیده
منابع مشابه
Virtually Geometric Words and Whitehead’s Algorithm
Motivated by a question of Gordon and Wilton, we consider the question of which collections of words are “virtually geometric”. In particular, we prove that some words (e.g. bbaaccabc) are not virtually geometric. 1. Definitions and introduction Let G be a group, g = {[gi]}i∈I a collection of conjugacy classes in G, and X some space. Any homomorphism φ : G → π1(X) induces a map, φg : ⊔
متن کاملSet partitions as geometric words
Using an analytic method, we derive an alternative formula for the probability that a geometrically distributed word of length n possesses the restricted growth property. Equating our result with a previously known formula yields an algebraic identity involving alternating sums of binomial coefficients via a probabilistic argument. In addition, we consider refinements of our formula obtained by...
متن کاملVirtually Adapted Reality and Algorithm Visualization for Autonomous Robots
Autonomous mobile robots are often videotaped during operation, whether for later evaluation by their developers or for demonstration of the robots to others. Watching such videos is engaging and interesting. However, clearly the plain videos do not show detailed information about the algorithms running on the moving robots, leading to a rather limited visual understanding of the underlying aut...
متن کاملA new geometric approach to Sturmian words
We introduce a new geometric approach to Sturmian words by means of a mapping that associates certain lines in the n× n-grid and sets of finite Sturmian words of length n. Using this mapping, we give new proofs of the formulas enumerating the finite Sturmian words and the palindromic finite Sturmian words of a given length. We also give a new proof for the well-known result that a factor of a S...
متن کاملA Virtually Synchronous Group Multicast Algorithm for WANs: Formal Approach
This paper presents a formal design for a novel group communication service targeted for wide-area networks (WANs). The service provides virtual synchrony semantics. Such semantics facilitate the design of fault tolerant distributed applications. The presented design is more suitable for WANs than previously suggested ones. In particular, it features the first algorithm to achieve virtual synch...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Research Letters
سال: 2010
ISSN: 1073-2780,1945-001X
DOI: 10.4310/mrl.2010.v17.n5.a9